A Generalized Carpenter's Rule Theorem for Self-Touching Linkages

نویسندگان

  • Timothy G. Abbott
  • Erik D. Demaine
  • Blaise Gassend
چکیده

The Carpenter’s Rule Theorem states that any chain linkage in the plane can be folded continuously between any two configurations while preserving the bar lengths and without the bars crossing. However, this theorem applies only to strictly simple configurations, where bars intersect only at their common endpoints. We generalize the theorem to self-touching configurations, where bars can touch but not properly cross. At the heart of our proof is a new definition of self-touching configurations of planar linkages, based on an annotated configuration space and limits of nontouching configurations. We show that this definition is equivalent to the previously proposed definition of self-touching configurations, which is based on a combinatorial description of overlapping features. Using our new definition, we prove the generalized Carpenter’s Rule Theorem using a topological argument. We believe that our topological methodology provides a powerful tool for manipulating all kinds of self-touching objects, such as 3D hinged assemblies of polygons and rigid origami. In particular, we show how to apply our methodology to extend to self-touching configurations universal reconfigurability results for open chains with slender polygonal adornments, and single-vertex rigid origami with convex cones. MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar St., Cambridge, MA 02139, USA, {tabbott,edemaine}@mit.edu Partially supported by an NSF Graduate Research Fellowship and an MIT-Akamai Presidential Fellowship. Partially supported by NSF CAREER award CCF-0347776, DOE grant DE-FG02-04ER25647, and AFOSR grant FA9550-071-0538. Exponent Failure Analysis Associates, 149 Commonwealth Drive, Menlo Park, CA 94025, USA, [email protected]. Work done while at MIT.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Folding and Unfolding with Linkages and Origami

We revisit foundational questions in the kinetic theory of linkages and origami, investigating their folding/unfolding behaviors and the computational complexity thereof. In Chapter 2, we exactly settle the complexity of realizability, rigidity, and global rigidy for graphs and linkages in the plane, even when the graphs are (1) promised to avoid crossings in all configurations, or (2) equilate...

متن کامل

SOME FUNDAMENTAL RESULTS ON FUZZY CALCULUS

In this paper, we study fuzzy calculus in two main branches differential and integral.  Some rules for finding limit and $gH$-derivative of $gH$-difference, constant multiple of two fuzzy-valued functions are obtained and we also present fuzzy chain rule for calculating  $gH$-derivative of a composite function.  Two techniques namely,  Leibniz's rule and integration by parts are introduced for ...

متن کامل

Fixed point theorem for non-self mappings and its applications in the modular ‎space

‎In this paper, based on [A. Razani, V. Rako$check{c}$evi$acute{c}$ and Z. Goodarzi, Nonself mappings in modular spaces and common fixed point theorems, Cent. Eur. J. Math. 2 (2010) 357-366.] a fixed point theorem for non-self contraction mapping $T$ in the modular space $X_rho$ is presented. Moreover, we study a new version of Krasnoseleskii's fixed point theorem for $S+T$, where $T$ is a cont...

متن کامل

GENERALIZED PRINCIPAL IDEAL THEOREM FOR MODULES

The Generalized Principal Ideal Theorem is one of the cornerstones of dimension theory for Noetherian rings. For an R-module M, we identify certain submodules of M that play a role analogous to that of prime ideals in the ring R. Using this definition, we extend the Generalized Principal Ideal Theorem to modules.

متن کامل

Infinitesimally Locked Self-Touching Linkages with Applications to Locked Trees

Recently there has been much interest in linkages (bar-and-joint frameworks) that are locked or stuck in the sense that they cannot be moved into some other configuration while preserving the bar lengths and not crossing any bars. We propose a new algorithmic approach for analyzing whether planar linkages are locked in many cases of interest. The idea is to examine self-touching or degenerate f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0901.1322  شماره 

صفحات  -

تاریخ انتشار 2008